Temporal Inegrity Constraints in Relational Databases
نویسنده
چکیده
منابع مشابه
Databases and Temporal Constraints :
We continue the development of a theory of constraint databases with indeenite information which we originated in our previous research. Initially we review the schemes of L-constraint databases and indeenite L-constraint databases where L, the parameter, is a rst-order constraint language. Then we consider several instances of these schemes where L is a language for expressing information abou...
متن کاملThe Complexity of Query Evaluation in Indefinite Temporal Constraint Databases
In previous work we have developed the scheme of indeenite L-constraint databases where L, the parameter, is a rst-order constraint language. This scheme extends the constraint database proposal of Kanellakis, Kuper and Revesz to include in-deenite (or uncertain) information in the style of Imielinski and Lipski. In this paper we study the complexity of query evaluation in an important instance...
متن کاملEnhancing the ER Model with Inegrity Methods
Entity Relationship (ER) schemas include cardinality constraints, that restrict the dependencies among entities within a relationship type. The cardinality constraints have direct impact on application transactions, since insertions or deletions of entities or relationships might affect related entities. Application transactions can be strengthened to preserve the consistency of a database with...
متن کاملA Fuzzy Temporal Object-Relational Database: Model and Implementation
In real world, some data have a specific temporal validity that must be appropiately managed. To deal with this kind of data, several proposals of temporal databases have been introduced. Moreover, time can also be affected by imprecision, vagueness, and/or uncertainty, since human beings manage time using temporal indications and temporal notions, which may also be imprecise. For this reason, ...
متن کاملAn Extended Algebra for Constraint
| Constraint relational databases use constraints to both model and query data. A constraint relation contains a nite set of generalized tuples. Each generalized tuple is represented by a conjunction of constraints on a given logical theory and, depending on the logical theory and the speciic conjunction of constraints, it may possibly represent an in-nite set of relational tuples. For their ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Data Eng. Bull.
دوره 17 شماره
صفحات -
تاریخ انتشار 1994